Minimum Distance Error Correction
نویسنده
چکیده
A method is presented for incorporating error correction using a minimum distance measure into LR parsers. The method is suitable for use by an automatic parser-generator. State information in the LR parser stack at the point of detection of error is used to generate a set of strings which are potential repairs to the input. A string with least minimum distance from the actual input is chosen and the parser is restarted. Practical methods for generating the set of repairs are discussed.
منابع مشابه
Minimum Distance of Concatenated Conjugate Codes for Cryptography and Quantum Error Correction
A polynomial construction of error-correcting codes for secure and reliable information transmission is presented. The constructed codes are essentially Calderbank-Shor-Steane (CSS) quantum codes, and hence are also useful for quantum error correction. The asymptotic relative minimum distance of these codes is evaluated, and shown to be larger than that of the codes constructed by Chen, Ling, a...
متن کاملWeight properties of network codes
In this paper, we first study the error correction and detection capability of codes for a general transmission system inspired by network error correction. For a given weight measure on the error vectors, we define a corresponding minimum weight decoder. Then we obtain a complete characterization of the capability of a code for 1) error correction; 2) error detection; and 3) joint error correc...
متن کاملA probabilistic algorithm for computing minimum weights of large error-correcting codes
Given a binary nonlinear code, we provide a deterministic algorithm to to use probabilistic algorithms for the computation of the minimum distance, such as the there are algorithms which perform much better than brute force, e.g. code with large minimum distance and the minimum weight, of any random binary code. code C over Fq of length n and dimension k capable of correction w errors. A matrix...
متن کاملGeneralized Minimum Distance Decoding for Correcting Array Errors
We consider an array error model for data in matrix form, where the corrupted symbols are confined to a number of lines (rows and columns) of the matrix. Codes in array metric (maximum term rank metric) are well suited for error correction in this case. We generalize the array metric to the case when the reliability of every line of the matrix is available. We propose a minimum distance decoder...
متن کاملCorrectable Errors of Weight Half the Minimum Distance for the First-Order Reed-Muller Codes
The number of correctable errors of weight half the minimum distance is given for the first-order binary Reed-Muller codes. It is shown that the size of trial set, which is introduced by Helleseth et al. and can be used for a minimum distance decoding or estimating the number of uncorrectable errors, for the first-order Reed-Muller codes is at least that of minimal codewords except for small code
متن کامل